A Comment on Pseudo-Triangulation in Three Dimensions
نویسنده
چکیده
Pseudo-triangulations in two dimensions had attracted attention in computational geometry in recent years [CEG+94, PV96, Str00, ABG+01]. We present one possible extension of this concept to three dimensions. Our construction has several desirable properties, among them having the same number pseudo-triangles, independent of the point configuration, overall linear complexity, and relatively simple construction.
منابع مشابه
Pseudo-tetrahedral complexes
A pseudo-triangulation is a cell complex in the plane whose cells are pseudo-triangles, i.e., simple polygons with exactly three convex vertices (so-called corners). Being an interesting and flexible generalization of triangulations, pseudo-triangulations have found their place in computational geometry; see e.g. [8, 11, 7, 1] and references therein. Unlike triangulations, pseudo-triangulations...
متن کاملEnumerating pseudo-triangulations in the plane
A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-t...
متن کامل2 00 6 Pseudo - Triangulations — a Survey
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as planar bar-and-joint frameworks in rigidity theory and as projections of locally convex surfaces. This survey of current literature includes combinatorial properties and co...
متن کاملResolving Loads with Positive Interior Stresses ( Extended
If the load F produces a linear or angular momentum it cannot be resolved by any framework. Therefore we restrict ourselves to loads with ∑ pi fi = 0 and ∑ pi 〈pi , fi〉 = 0. (The vector pi denotes pi rotated by 90 degrees.) If a framework can resolve any load it is called statically rigid. Static rigidity is an equivalent condition for infinitesimal rigidity (see [3]). In general a statically r...
متن کاملMinimum Pseudo-Triangulation Using Convex Hull Layers
Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudotriangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the number of pseudo-triangles created in minimu...
متن کامل